- adjacencies
- • смежность• соседства
Англо-русский словарь компьютерных и интернет терминов. 2013.
adjacencies
Смотреть что такое "adjacencies" в других словарях:
adjacencies — n. being located next to, being adjacent; nearness … English contemporary dictionary
Adjacencies — RadioPP Commercials strategically placed next to a feature … Audio and video glossary
Enhanced Interior Gateway Routing Protocol — (EIGRP) is a Cisco proprietary routing protocol loosely based on their original IGRP. EIGRP is an advanced distance vector routing protocol, with optimizations to minimize both the routing instability incurred after topology changes, as well as… … Wikipedia
Cisco Express Forwarding — (CEF) is an advanced layer 3 switching technology used mainly in large core networks or the Internet to enhance the overall network performance. Function CEF is mainly used to increase packet switching speed by reducing the overhead and delays… … Wikipedia
Dual polyhedron — The dual of a cube is an octahedron, shown here with vertices at the cube face centers … Wikipedia
Open Shortest Path First — (OSPF) is an adaptive routing protocol for Internet Protocol (IP) networks. It uses a link state routing algorithm and falls into the group of interior routing protocols, operating within a single autonomous system (AS). It is defined as OSPF… … Wikipedia
Network mapping — A visual representation of a part of the Internet. Network mapping is the study of the physical connectivity of networks. Internet mapping is the study of the physical connectivity of the Internet. Network mapping often attempts to determine the… … Wikipedia
Line graph — This article is about the mathematical concept. For statistical presentation method, see line chart. In graph theory, the line graph L(G) of undirected graph G is another graph L(G) that represents the adjacencies between edges of G. The name… … Wikipedia
Moore graph — Unsolved problems in mathematics Does a Moore graph with girth 5 and degree 57 exist? In graph theory, a Moore graph is a regular graph of degree d and diameter k whose number of vertices equals the upper bound An equivalent definition of a Moore … Wikipedia
Modular decomposition — In graph theory, the modular decomposition is a decomposition of an undirected graph into subsets of vertices called modules. A module is a generalization of a connected component of a graph. Unlike connected components, however, one module can… … Wikipedia
adjacency — /euh jay seuhn see/, n., pl. adjacencies. 1. Also, adjacence. the state of being adjacent; nearness. 2. Usually, adjacencies. things, places, etc., that are adjacent. 3. Radio and Television. a broadcast or announcement immediately preceding or… … Universalium
